Colin de Verdiere parameters of chordal graphs
نویسندگان
چکیده
The Colin de Verdière parameters, μ and ν, are defined to be the maximum nullity of certain real symmetric matrices associated with a given graph. In this work, both of these parameters are calculated for all chordal graphs. For ν the calculation is based solely on maximal cliques, while for μ the calculation depends on split subgraphs. For the case of μ our work extends some recent work on computing μ for split graphs.
منابع مشابه
Ela Colin De Verdière Parameters of Chordal Graphs
The Colin de Verdière parameters, μ and ν, are defined to be the maximum nullity of certain real symmetric matrices associated with a given graph. In this work, both of these parameters are calculated for all chordal graphs. For ν the calculation is based solely on maximal cliques, while for μ the calculation depends on split subgraphs. For the case of μ our work extends some recent work on com...
متن کاملA variant on the graph parameters of Colin de Verdiere: Implications to the minimum rank of graphs
For a given undirected graph G, the minimum rank of G is defined to be the smallest possible rank over all real symmetric matrices A whose (i, j)th entry is nonzero whenever i = j and {i, j} is an edge in G. Building upon recent work involving maximal coranks (or nullities) of certain symmetric matrices associated with a graph, a new parameter ξ is introduced that is based on the corank of a di...
متن کاملComplement of Special Chordal Graphs and Vertex Decomposability
In this paper, we introduce a subclass of chordal graphs which contains $d$-trees and show that their complement are vertex decomposable and so is shellable and sequentially Cohen-Macaulay.
متن کاملTotal-Chromatic Number and Chromatic Index of Dually Chordal Graphs
A graph is dually chordal if it is the clique graph of a chordal graph. Alternatively, a graph is dually chordal if it admits a maximum neighbourhood order. This class generalizes known subclasses of chordal graphs such as doubly chordal graphs, strongly chordal graphs and interval graphs. We prove that Vizing's total-colour conjecture holds for dually chordal graphs. We describe a new heuristi...
متن کاملOn basic chordal graphs and some of its subclasses
Basic chordal graphs arose when comparing clique trees of chordal graphs and compatible trees of dually chordal graphs. They were defined as those chordal graphs whose clique trees are exactly the compatible trees of its clique graph. In this work, we consider some subclasses of basic chordal graphs. One of them is the class of hereditary basic chordal graphs, which will turn out to have many p...
متن کامل